5 O ct 2 00 7 CONNECTIVITY OF ADDITION CAYLEY GRAPHS

نویسنده

  • ORIOL SERRA
چکیده

For any finite abelian group G and any subset S ⊆ G, we determine the connectivity of the addition Cayley graph induced by S on G. Moreover, we show that if this graph is not complete, then it possesses a minimum vertex cut of a special, explicitly described form. 1. Background: addition Cayley graphs For a subset S of the abelian group G, we denote by Cay+G(S) the addition Cayley graph induced by S on G; recall that this is the undirected graph with the vertex set G and the edge set {(g1, g2) ∈ G × G : g1 + g2 ∈ S}. Note that S is not assumed to be symmetric, and that if S is finite, then Cay+G(S) is regular of degree |S| (if one considers each loop to contribute 1 to the degree of the corresponding vertex). The twins of the usual Cayley graphs, addition Cayley graphs (also called sum graphs) received much less attention in the literature; indeed, [A] (independence number), [CGW03] and [L] (hamiltonicity), [C92] (expander properties), and [Gr05] (clique number) is a nearly complete list of papers, known to us, where addition Cayley graphs are addressed. To some extent, this situation may be explained by the fact that addition Cayley graphs are rather difficult to study. For instance, it is well-known and easy to prove that any connected Cayley graph on a finite abelian group with at least three elements is hamiltonian, see [Mr83]; however, apart from the results of [CGW03], nothing seems to be known on hamiltonicity of addition Cayley graphs on finite abelian groups. Similarly, the connectivity of a Cayley graph on a finite abelian group is easy to determine, while determining the connectivity of an addition Cayley graph is a non-trivial problem, to the solution of which the present paper is devoted. The reader will see that investigating this problem leads to studying rather involved combinatorial properties of the underlying group. The first author is supported in part by the National Science Foundation, as an MPS-DRF postdoctoral fellow, under grant DMS-0502193. MSC: 11B75 (05C25, 11P70).

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

ar X iv : 0 71 0 . 11 83 v 1 [ m at h . C O ] 5 O ct 2 00 7 CONNECTIVITY OF ADDITION CAYLEY GRAPHS

For any finite abelian group G and any subset S ⊆ G, we determine the connectivity of the addition Cayley graph induced by S on G. Moreover, we show that if this graph is not complete, then it possesses a minimum vertex cut of a special, explicitly described form. 1. Background: addition Cayley graphs For a subset S of the abelian group G, we denote by Cay+G(S) the addition Cayley graph induced...

متن کامل

ON THE REFINEMENT OF THE UNIT AND UNITARY CAYLEY GRAPHS OF RINGS

Let $R$ be a ring (not necessarily commutative) with nonzero identity. We define $Gamma(R)$ to be the graph with vertex set $R$ in which two distinct vertices $x$ and $y$ are adjacent if and only if there exist unit elements $u,v$ of $R$ such that $x+uyv$ is a unit of $R$. In this paper, basic properties of $Gamma(R)$ are studied. We investigate connectivity and the girth of $Gamma(R)$, where $...

متن کامل

The planar cubic Cayley graphs of connectivity 2

We classify the planar cubic Cayley graphs of connectivity 2, providing an explicit presentation and embedding for each of them. Combined with [9] this yields a complete description of all planar cubic Cayley graphs.

متن کامل

Cayley graphs and symmetric interconnection networks

These lecture notes are on automorphism groups of Cayley graphs and their applications to optimal fault-tolerance of some interconnection networks. We first give an introduction to automorphisms of graphs and an introduction to Cayley graphs. We then discuss automorphism groups of Cayley graphs. We prove that the vertex-connectivity of edge-transitive graphs is maximum possible. We investigate ...

متن کامل

On the distance eigenvalues of Cayley graphs

In this paper, we determine the distance matrix and its characteristic polynomial of a Cayley graph over a group G in terms of irreducible representations of G. We give exact formulas for n-prisms, hexagonal torus network and cubic Cayley graphs over abelian groups. We construct an innite family of distance integral Cayley graphs. Also we prove that a nite abelian group G admits a connected...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2007